Projected Reflected Gradient Methods for Monotone Variational Inequalities
نویسنده
چکیده
This paper is concerned with some new projection methods for solving variational inequality problems with monotone and Lipschitz-continuous mapping in Hilbert space. First, we propose the projected reflected gradient algorithm with a constant stepsize. It is similar to the projected gradient method, namely, the method requires only one projection onto the feasible set and only one value of the mapping per iteration. This distinguishes our method from most other projection-type methods for variational inequalities with monotone mapping. Also we prove that it has R-linear rate of convergence under the strong monotonicity assumption. The usual drawback of algorithms with constant stepsize is the requirement to know the Lipschitz constant of the mapping. To avoid this, we modify our first algorithm so that the algorithm needs at most two projections per iteration. In fact, our computational experience shows that such cases with two projections are very rare. This scheme, at least theoretically, seems to be very effective. All methods are shown to be globally convergent to a solution of the variational inequality. Preliminary results from numerical experiments are quite promising.
منابع مشابه
A Relaxed Extra Gradient Approximation Method of Two Inverse-Strongly Monotone Mappings for a General System of Variational Inequalities, Fixed Point and Equilibrium Problems
متن کامل
Minty Variational Inequalities and Monotone Trajectories of Differential Inclusions
In [8] the notion of “projected differential equation” has been introduced and the stability of solutions has been studied by means of Stampacchia type variational inequalities. More recently, in [20], Minty variational inequalities have been involved in the study of properties of the trajectories of such a projected differential equation. We consider classical generalizations of both problems,...
متن کاملGap Functions and Descent Methods for Minty Variational Inequality
A new class of gap functions associated to the variational inequality introduced by Minty is defined. Descent methods for the minimization of the gap functions are analysed in order to develop exact and inexact line-search algorithms for solving strictly and strongly monotone variational inequalities, respectively.
متن کاملSolutions of variational inequalities on fixed points of nonexpansive mappings
n this paper , we propose a generalized iterative method forfinding a common element of the set of fixed points of a singlenonexpannsive mapping and the set of solutions of two variationalinequalities with inverse strongly monotone mappings and strictlypseudo-contractive of Browder-Petryshyn type mapping. Our resultsimprove and extend the results announced by many others.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM Journal on Optimization
دوره 25 شماره
صفحات -
تاریخ انتشار 2015